Experimental quantum homomorphic encryption
نویسندگان
چکیده
Abstract Quantum computers promise not only to outperform classical machines for certain important tasks, but also preserve privacy of computation. For example, the blind quantum computing protocol enables secure delegated computation, where a client can protect their data and algorithms from server assigned run However, this security comes with practical limitation that must communicate after each step A alternative is homomorphic encryption, which does require any interactions, while providing quantum-enhanced variety computations. In scenario, specifies computation be performed, provides input data, thus enabling noninteractive Here, we demonstrate homomorphic-encrypted unitary transformations individual qubits, as well multi-qubit walk computations using single-photon states non-birefringent integrated optics. The encrypts in photons’ polarization state, performs path degree freedom. Our demonstration photonics underlines applicability computations, shows potential photons.
منابع مشابه
A quantum approach to fully homomorphic encryption
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of the group of unitary operations to present a private-key quantum homomorphic encryption scheme that hides arbitrary quantum computations. A particular instance of our encoding hides information at least proportional to m/ log...
متن کاملClassical Homomorphic Encryption for Quantum Circuits
We present a computationally secure classical homomorphic encryption scheme for quantum circuits. The scheme allows a classical server to blindly delegate a quantum computation to a quantum server; the server is able to run the computation without learning about the computation itself. This result relies on postquantum classical cryptographic tools, including sub-exponentially secure indistingu...
متن کاملQuantum Homomorphic Encryption for Polynomial-Sized Circuits
We present a new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits. Building on the framework of Broadbent and Jeffery [BJ15] and recent results in the area of instantaneous non-local quantum computation [Spe15], we show how to construct quantum gadgets that allow perfect correction of the errors which o...
متن کاملOn Statistically-Secure Quantum Homomorphic Encryption
Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an informationtheoretically-secure (ITS...
متن کاملQuantum Fully Homomorphic Encryption with Verification
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: npj Quantum Information
سال: 2021
ISSN: ['2056-6387']
DOI: https://doi.org/10.1038/s41534-020-00340-8